Asymptotically Optimal Scalable Coding for Minimum Weighted Mean Square Error
نویسندگان
چکیده
In this paper, we derive an asymptotically optimal multi-layer coding scheme for entropy-coded scalar quantizers (SQ) that minimizes the weighted mean-squared error (WMSE). The optimal entropy-coded SQ is non-uniform in the case of WMSE. The conventional multi-layer coder quantizes the base-layer reconstruction error at the enhancement-layer, and is sub-optimal for the WMSE criterion. We consider the compander representation of the quantizer, and propose to implement scalability in the compressed domain. We show that such a multi-layer coding system achieves the operational rate-distortion bound given by the non-scalable entropy-coded SQ, at the limit of high resolution. Simulation results for a synthetic memoryless Laplace source with -law companding are presented for various values of layer rates. Substantial gains are also achieved on the \real-world" sources of audio signals, when the optimal multi-layer approach is applied to a two-layer scalable MPEG-4 Advanced Audio Coder.
منابع مشابه
The Optimal MMSE Transceiver Design for IoT-oriented Cognitive Radio Systems
This paper studies interference alignment scheme and minimum mean square error (MMSE) improvement in Internet of Things (IoT)-oriented cognitive systems, where IoT devices share the licensed spectrum by cognitive radio in spectrum underlay. Target to manage the inter-tier interference caused by cognitive spectrum sharing as well as ensure an MMSE at receivers, the interference alignment algorit...
متن کاملError rates of Belavkin weighted quantum measurements and a converse to Holevo’s asymptotic optimality Theorem
We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called “pretty good measurement” (PGM) in a number of respects: 1. Holevo’s quadratic weighting unconditionally outperforms the PGM in the case of twostate ensembles, with ...
متن کاملAsymptotic Bounds on Optimal Noisy Channel Quantization Via Random Coding
Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average r th-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability. The upper bound asymptoti-cally equals 2 ?rRg(;k;r) , where ...
متن کاملOptimal designs for space-time linear precoders and decoders
In this paper we introduce a new paradigm for the design of transmitter space-time coding that we refer to as linear precoding. It leads to simple closed form solutions for transmission over frequency selective multiple-input multiple-output (MIMO) channels , which are scalable with respect to the number of antennas, size of the coding block and transmit average/peak power. The scheme operates ...
متن کاملAsymptotic Optimality of Regular Sequence Designs
We study linear estimators for the weighted integral of a stochastic process. The process may only be observed on a nite sampling design. The error is deened in mean square sense, and the process is assumed to satisfy Sacks-Ylvisaker regularity conditions of order r 2 N 0. We show that sampling at the quantiles of a particular density already yields asymptotically optimal estimators. Hereby we ...
متن کامل